Compositional Verification of Multi-Agent Systems in Temporal Multi-Epistemic Logic

نویسندگان

  • Joeri Engelfriet
  • Catholijn M. Jonker
  • Jan Treur
چکیده

Compositional verification aims at managing the complexity of the verification process by exploiting compositionality of the system architecture. In this paper we explore the use of a temporal epistemic logic to formalize the process of verification of compositional multi-agent systems. The specification of a system, its properties and their proofs are of a compositional nature, and are formalized within a compositional temporal logic: Temporal Multi-Epistemic Logic. It is shown that compositional proofs are valid under certain conditions. Finally, the possibility of incorporating default persistence of information in a system, is explored.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Bounded Model Checking for Linear Time Temporal-Epistemic Logic

We present a novel approach to the verification of multi-agent systems using bounded model checking for specifications in LTLK, a linear time temporal-epistemic logic. The method is based on binary decision diagrams rather than the standard conversion to Boolean satisfiability. We apply the approach to two classes of interpreted systems: the standard, synchronous semantics and the interleaved s...

متن کامل

Model Checking Temporal-Epistemic Logic Using Tree Automata

We introduce an automata-theoretic approach for the verification of multi-agent systems. We present a translation between branching time temporal-epistemic logic and alternating tree automata. Model checking an interpreted system against a temporal-epistemic formula is reduced to checking the non-emptiness of the composition of two tree automata. We exemplify this technique using a simple multi...

متن کامل

Technical Report Satisfiability of ATEL with Common and Distributed Knowledge is ExpTime-Complete

Alternating-time Temporal Logic (ATL) of Alur, Henzinger, and Kupferman is increasingly widely applied in formal system specification and verification of distributed systems and game-like multi-agent systems. The extension Alternating-time Temporal Epistemic Logic (ATEL) of van der Hoek and Wooldridge of ATL with knowledge modalities widens the scope of reasoning over multi-agent systems with e...

متن کامل

Verification of Multi-agent Systems Via Bounded Model Checking

We present a bounded model checking (BMC) approach to the verification of temporal epistemic properties of multi-agent systems. We extend the temporal logic CTL∗ by incorporating epistemic modalities and obtain a temporal epistemic logic that we call CTL∗K. CTL∗K logic is interpreted under the semantics of synchronous interpreted systems. Though CTL∗K is of great expressive power in both tempor...

متن کامل

Parallel Model Checking for Temporal Epistemic Logic

We investigate the problem of the verification of multiagent systems by means of parallel algorithms. We present algorithms for CTLK, a logic combining branching time temporal logic with epistemic modalities. We report on an implementation of these algorithms and present the experimental results obtained. The results point to a significant speed-up in the verification step.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1998